Simultaneous Speculation Scheduling - A Technique for Speculative Dual Path Execution

نویسندگان

  • Andreas Unger
  • Eberhard Zehendner
  • Theo Ungerer
چکیده

Commodity microprocessors uniformly apply branch prediction and single path speculative execution to all kinds of program branches and suuer from the high misprediction penalty which is caused by branches with low prediction accuracy and, in particular, by branches that are unpredictable. The Simultaneous Speculation Scheduling (S 3) technique removes such penalties by a combination of compiler and architectural techniques that enable speculative dual path execution after program branches. Two separate threads that represent alternative program paths after a branch instruction are generated by the compiler. Both threads are simultaneously executed although only one of them follows the eventually correct program path. The architectural requirements are the ability to run two or more threads in parallel, and an enhancement of the instruction set by instructions that start respectively terminate threads. We use program kernels from the SPECint95 benchmark suite to demonstrate the performance gain by the Simultaneous Speculation Scheduling technique over the single path branch speculation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Utilising parallel resources by speculation

This paper introduces Simultaneous Speculation Scheduling, a new compiler technique that enables speculative execution of alternative program paths. In our approach concurrently executed threads are generated that represent alternative program paths. Each thread is the result of a speculation on the outcome of one or more branches. All threads are simultaneously executed although only one of th...

متن کامل

Speculative Hedge: Regulating Compile-time Speculation against Proole Variations

Path-oriented scheduling methods, such as trace scheduling and hyperblock scheduling, use speculation to extract instruction-level parallelism from control-intensive programs. These methods predict important execution paths in the current scheduling scope using execution prooling or frequency estimation. Aggressive speculation is then applied to the important execution paths, possibly at the co...

متن کامل

Speculative Hedge: Regulating Compile-Time Speculation Against Pro le Variations

Path-oriented scheduling methods, such as trace scheduling and hyperblock scheduling, use speculation to extract instruction-level parallelism from control-intensive programs. These methods predict important execution paths in the current scheduling scope using execution pro ling or frequency estimation. Aggressive speculation is then applied to the important execution paths, possibly at the co...

متن کامل

Store Vulnerability Window (SVW): A Filter and Potential Replacement for Load Re-Execution

Load scheduling and execution are performance critical aspects of dynamically-scheduled processing. Several techniques employ speculation on loads with respect to older stores to improve some aspect of load processing. Speculative scheduling and speculative indexed store-load forwarding are two examples. Speculative actions require verification. One simple mechanism that can verify any load spe...

متن کامل

Quantifying the Impacts of Disabling Speculation and Relaxing the Scheduling Loop in Multithreaded Processors By

Traditional architectural approaches for increasing microprocessor performance rely on the use of large, complex, highly-speculative out-of-order cores to extract InstructionLevel Parallelism (ILP) from single-threaded applications. In order to realize high performance, these designs employ a myriad of speculative techniques, ranging from branch prediction to load-latency prediction and memory-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999